Casting a polyhedron with directional uncertainty
نویسندگان
چکیده
منابع مشابه
Casting a Polyhedron with Directional Uncertainty
Casting is a manufacturing process in which molten material is poured into a cast (mould), which is opened after the material has solidified. As in all applications of robotics, we have to deal with imperfect control of the casting machinery. In this paper, we consider directional uncertainty: given a 3-dimensional polyhedral object, is there a polyhedral cast such that its two parts can be rem...
متن کاملRay-casting point-in-polyhedron test
This paper considers a ray-casting point-in polyhedron test. Although it is conceptually the simple extension of a well-known point-in-polygon ray-casting algorithm, various practical problems appear in 3D, especially, when the boundary of a geometric object is represented as a triangulated surface. When a larger number of points have to be tested regarding their positions on the considered geo...
متن کاملReaching a Polygon with Directional Uncertainty
Assume a robot that, when directed to move in a particular direction, is guaranteed to move inside a cone of angle centered at the speci ed direction. The robot has to reach a convex polygonal goal G, while avoiding polygonal obstacles of complexity n. We show that the complexity of the safe region, from where the robot can reach the goal with a single linear motion with uncertainty , is O(m+n)...
متن کاملReaching a Goal with Directional Uncertainty
We study two problems related to planar motion planning for robots with imperfect control, where, if the robot starts a linear movement in a certain commanded direction, we only know that its actual movement will be con ned in a cone of angle centered around the speci ed direction. First, we consider a single goal region, namely the \region at in nity", and a set of polygonal obstacles, modeled...
متن کاملA starshaped polyhedron with no net
A simple construction is given for a polyhedron which establishes the following theorem of A. S. Tarasov: There exist polyhedra of spherical type, with convex faces, which admit no planar nets. The net of a polyhedron P consists of a connected collection of polygons, congruent to the faces of the polyhedron, arranged in one plane (conveniently thought of as a sheet of cardboard) without overlap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2003
ISSN: 0925-7721
DOI: 10.1016/s0925-7721(02)00167-0